|
|
Heuristic Methods for General Routing Problems
Muchna, Jan ; Fábry, Jan (advisor) ; Šindelářová, Irena (referee)
The purpose of this work is an analysis of the current state of heuristic methods and their evaluation based on following attributes: accuracy, speed and quality of coding. The work is divided into 3 sections: an introduction to the general routing problem, methods of evaluations and describtion of tangible heuristics and metaheuristics methods. Following algorithms are depicted - from classical heuristics: Clarke and Wright algorithm, Sweep algorithm, Fisher-Jaikumar algorithm, Repeated matching algorithm, Location based heuristics and Petal heuristics - from metaheuristcs: General methods based on Tabu search, Taburoute algorithm, Adaptive memory method. Particular focus of the work is given to Repeated matching algorithm.
|
guest ::
